Approximation algorithms for minimum (weight) connected k-path vertex cover

Minimum k-path vertex cover

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining ψk(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of ψk(G) and pr...

Approximation Algorithms 1.1 Minimum Vertex Cover

1 Approximation Algorithms Any known algorithm that finds the solution to an NP-hard optimization problem has exponential running time. However, sometimes polynomial time algorithms exist which find a " good " solution instead of an optimum solution. Given a minimization problem and an approximation algorithm, we can evaluate the algorithm as follows. First, we find a lower bound on the optimum...

Experimental Comparison of Five Approximation Algorithms for Minimum Vertex Cover

Numerous approximation algorithms have been presented by researchers for approximation of minimum vertex cover, all of these approaches have deficiencies in one way or another. As minimum vertex cover is NP-Complete so we can’t find out optimal solution so approximation is the way left but it is very hard for someone to decide which one procedure to use, in this comparison paper we have selecte...

Approximation algorithm for the minimum weight connected k-subgraph cover problem

Article history: Received 16 December 2013 Received in revised form 5 March 2014 Accepted 24 March 2014 Communicated by P. Widmayer

An Approximation Algorithm Forthe Minimum - Cost K - Vertex Connected